Reconstructing Words from Right-Bounded-Block Words

A reconstruction problem of words from scattered factors asks for the minimal information, like multisets a given length or number occurrences set, necessary to uniquely determine word. We show that word [Formula: see text] can be reconstructed at most form text], where is letter in text]. Moreover, we generalise result alphabets by showing suffices reconstruct Both results improve on upper bounds known so far. Complexity time algorithms are also considered here.